Model-Based Joint Bit Allocation Between Geometry and Color for Video-Based 3D Point Cloud Compression

نویسندگان

چکیده

In video-based 3D point cloud compression, the quality of reconstructed depends on both geometry, and color distortions. Finding an optimal allocation total bitrate between geometry coder, coder is a challenging task due to large number possible solutions. To solve this bit problem, we first propose analytical distortion, rate models for information. Using these models, formulate joint problem as constrained convex optimization it with interior method. Experimental results show that rate-distortion performance proposed solution close obtained exhaustive search but at only 0.66 $\%$ its time complexity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted bit allocation for multiresolution 3D mesh geometry compression

In this paper, we propose an eÆcient geometry cmpression method well-adapted to densely sampled semiregular triangular meshes. Based on multiresolution analysis performed by wavelet transform, it includes a low complexity model-based bit allocation across wavelet subbands. The main contribution of this paper is the resolution of the sub-optimal bit allocation problem related to biorthogonal wav...

متن کامل

Joint Depth/Texture Bit-Allocation For Multi-View Video Compression

Multi−View display technology allows the presentation of a 3D video by showing simultaneously several views of the same scene. One approach to render these multiple views is to synthesize novel views using a Depth Image Based Rendering (DIBR) algorithm. Consequently, for the efficient transmission of 3D video signals, the compression of texture and also the depth images is required. Since the r...

متن کامل

Octree-based Point-Cloud Compression

In this paper we present a progressive compression method for point sampled models that is specifically apt at dealing with densely sampled surface geometry. The compression is lossless and therefore is also suitable for storing the unfiltered, raw scan data. Our method is based on an octree decomposition of space. The point-cloud is encoded in terms of occupied octree-cells. To compress the oc...

متن کامل

Optimal Bit Allocation in 3D Compression

To use 3D models on the Internet or in other bandwidth-limited applications, it is often necessary to compress their triangle mesh representations. We consider the problem of balancing two forms of lossy mesh compression: reduction of the number of vertices by simplification, and reduction of the number of bits of resolution used per vertex coordinate via quantization. Let A be a triangle mesh ...

متن کامل

Geometric 3D point cloud compression

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Multimedia

سال: 2021

ISSN: ['1520-9210', '1941-0077']

DOI: https://doi.org/10.1109/tmm.2020.3023294